A convergence analysis of the nonlinear Uzawa algorithm for saddle point problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence Analysis of the Modified Nonlinear Inexact Uzawa Algorithm for Saddle Point Problem

This paper focuses on the convergence of the modified nonlinear inexact Uzawa algorithm (MNIU) for solving the saddle point problem. We improve the sufficient conditions for convergence and the convergence rate shown in Bramble et al. [J. Bramble, J. Pasciak, and A. Vassilev, Analysis of the inexact Uzawa algorithm for saddle point problems, SIAM J. Numer. Anal., 34 (1997), pp. 1072–1092] and Y...

متن کامل

Semi-convergence Analysis of the Inexact Uzawa Method for Singular Saddle Point Problems

Recently, various Uzawa methods were proposed based on different matrix splitting for solving nonsingular saddle point problems, and the necessary and sufficient condition of the convergence for those Uzawa methods were derived. Motivated by their results, in this paper we give the semi-convergence analysis of the inexact Uzawa method which is applied to solve singular saddle point problems und...

متن کامل

Nonlinear Inexact Uzawa Algorithms for Linear and Nonlinear Saddle-point Problems

This paper proposes some nonlinear Uzawa methods for solving linear and nonlinear saddle-point problems. A nonlinear inexact Uzawa algorithm is first introduced for linear saddlepoint problems. Two different PCG techniques are allowed in the inner and outer iterations of the algorithm. This algorithm is then extended for a class of nonlinear saddle-point problems arising from some convex optimi...

متن کامل

Global and Superlinear Convergence of Inexact Uzawa Methods for Saddle Point Problems with Nondiierentiable Mappings

This paper investigates inexact Uzawa methods for nonlinear saddle point problems. We prove that the inexact Uzawa method converges globally and superlinearly even if the derivative of the nonlinear mapping does not exist. We show that the Newton-type decomposition method for saddle point problems is a special case of a Newton-Uzawa method. We discuss applications of inexact Uzawa methods to se...

متن کامل

Multilevel Gradient Uzawa Algorithms for Symmetric Saddle Point Problems

In this paper, we introduce a general multilevel gradient Uzawa algorithm for symmetric saddle point systems. We compare its performance with the performance of the standard Uzawa multilevel algorithm. The main idea of the approach is to combine a double inexact Uzawa algorithm at the continuous level with a gradient type algorithm at the discrete level. The algorithm is based on the existence ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2007

ISSN: 0893-9659

DOI: 10.1016/j.aml.2006.12.009